Intersection algorithms for nonlinear geometric modeling
نویسنده
چکیده
The next generation geometric modeling systems have higher requirements on the reliability and the efficiency of Boolean operations. The two parts of these technical reports describe the details of the nonlinear intersection algorithms developed at EDRC. The prototype of the algorithms has been shown to be robust, accurate, and efficient, without the overhead of subdivision. The first part of this report describes the intersection routines of lower dimensions. 'This work has been supported by the Engineering Design Research Center, an NSF Engineering Research Center.
منابع مشابه
ANT COLONY ALGORITHMS FOR NONLINEAR ANALYSIS AND OPTIMAL DESIGN OF STRUCTURES
In this paper nonlinear analysis of structures are performed considering material and geometric nonlinearity using force method and energy concepts. For this purpose, the complementary energy of the structure is minimized using ant colony algorithms. Considering the energy term next to the weight of the structure, optimal design of structures is performed. The first part of this paper contains ...
متن کاملروابط جدید زمان چرخه بهینه برای تقاطعهای پیشزمانبندی شده مستقل با تغییر رابطه وبستر براساس روش HCM 2000
When the degree of saturation at intersection approaches one, Webster’s optimum cycle length equation becomes inapplicable, because the cycle length will becomes very big when the degree of saturation approaches one and will be fully unrealistic when the degree of saturation becomes greater than one. This is not a problem for HCM2000 method. But optimum cycle length calculation in this method h...
متن کاملIntersection Detection of Convex Polygons
Detecting whether two geometric objects intersect and computing the region of intersection are fundamental problems in computational geometry. Geometric intersection problems arise naturally in a number of applications. Examples include geometric packing and covering, wire and component layout in VLSI, map overlay in geographic information systems, motion planning, and collision detection. In s...
متن کاملA Generic Design for Implementing Intersection Between Triangles in Computer Vision and Spatial Reasoning
The intersection between 3D objects plays a prominent role in spatial reasoning, and computer vision. Detection of intersection between objects can be based on the triangulated boundaries of the objects, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross and coplanar intersection. For qualitative reasoning, intersection detection is suffic...
متن کاملA Triangle-Triangle Intersection Algorithm
The intersection between 3D objects plays a prominent role in spatial reasoning, geometric modeling and computer vision. Detection of possible intersection between objects can be based on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross intersection and coplanar intersection. There is no single algor...
متن کامل